The Ramanujan Property for Regular Cubical Complexes

نویسنده

  • BRUCE W. JORDAN
چکیده

We consider cubical complexes which are uniformized by an ordered product of regular trees. For these we define the notion of being Ramanujan, generalizing the one-dimensional definition introduced by Lubotzky, Phillips, and Sarnak [15]. As in [12], we also allow local systems. We discuss the significance of this property, and then we construct explicit arithmetic examples using quaternion algebras over totally real fields. Here we reduce the Ramanujan property to special cases of the Ramanujan-Petersson conjecture, many of which are known. Our examples subsume the constructions of [15], [12], and [17].

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Random Walks on Ramanujan Complexes and Digraphs

The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group G over a local field F . We show that if T is any k-regular G-equivariant operator on the Bruhat–Tits building with a simple combinatorial property ...

متن کامل

Towards Constructing Ramanujan Graphs Using Shift Lifts

In a breakthrough work, Marcus et al. [15] recently showed that every d-regular bipartite Ramanujan graph has a 2-lift that is also d-regular bipartite Ramanujan. As a consequence, a straightforward iterative brute-force search algorithm leads to the construction of a d-regular bipartite Ramanujan graph on N vertices in time 2. Shift k-lifts studied in [1] lead to a natural approach for constru...

متن کامل

Constructing Ramanujan Graphs Using Shift Lifts

In a breakthrough work, Marcus et al. [15] recently showed that every d-regular bipartite Ramanujan graph has a 2-lift that is also d-regular bipartite Ramanujan. As a consequence, a straightforward iterative brute-force search algorithm leads to the construction of a d-regular bipartite Ramanujan graph on N vertices in time 2. Shift k-lifts studied in [1] lead to a natural approach for constru...

متن کامل

Spectrum and Combinatorics of Ramanujan Triangle Complexes

Ramanujan graphs have extremal spectral properties, which imply a remarkable combinatorial behavior. In this paper we compute the high-dimensional Laplace spectrum of Ramanujan triangle complexes, and show that it implies a combinatorial expansion property, and a pseudo-randomness result. For this purpose we prove a Cheeger-type inequality and a mixing lemma of independent interest.

متن کامل

Cubical 2-complexes with the 8-property Admit a Strongly Convex Metric

We study metric conditions implied by a combinatorial curvature condition on a finite cubical 2-complex. Our main result is that any finite, simply connected, cubical 2-complex with the 8-property, admits a strongly convex metric. 2000 Mathematics Subject Classification: 53C21.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000